0.08/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n027.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 02:13:34 EDT 2025
0.12/0.33	% CPUTime    : 
0.21/0.47	Running higher-order theorem proving
0.21/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.t66SvZXAMl/E---3.1_25596.p
0.21/0.50	# Version: 3.0.0-ho
0.21/0.50	# Preprocessing class: HSSSSMSSSSSNSSA.
0.21/0.50	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
0.21/0.50	# Starting post_as_ho12 with 240s (1) cores
0.21/0.50	# Starting new_bool_9 with 240s (1) cores
0.21/0.50	# Starting post_as_ho1 with 240s (1) cores
0.21/0.50	# Starting post_as_ho4 with 240s (1) cores
0.21/0.50	# Starting post_as_ho2 with 240s (1) cores
0.21/0.50	# Starting ehoh_best2_full_lfho with 240s (1) cores
0.21/0.50	# Starting full_lambda_10 with 240s (1) cores
0.21/0.50	# Starting new_ho_8 with 240s (1) cores
0.21/0.50	# post_as_ho12 with pid 25686 completed with status 0
0.21/0.50	# Result found by post_as_ho12
0.21/0.50	# Preprocessing class: HSSSSMSSSSSNSSA.
0.21/0.50	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
0.21/0.50	# Starting post_as_ho12 with 240s (1) cores
0.21/0.50	# No SInE strategy applied
0.21/0.50	# Search class: HGHNS-FFSF11-SSSFFFNN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.21/0.50	# Starting new_ho_10 with 130s (1) cores
0.21/0.50	# new_ho_10 with pid 25694 completed with status 0
0.21/0.50	# Result found by new_ho_10
0.21/0.50	# Preprocessing class: HSSSSMSSSSSNSSA.
0.21/0.50	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
0.21/0.50	# Starting post_as_ho12 with 240s (1) cores
0.21/0.50	# No SInE strategy applied
0.21/0.50	# Search class: HGHNS-FFSF11-SSSFFFNN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.21/0.50	# Starting new_ho_10 with 130s (1) cores
0.21/0.50	# Preprocessing time       : 0.001 s
0.21/0.50	# Presaturation interreduction done
0.21/0.50	
0.21/0.50	# Proof found!
0.21/0.50	# SZS status Theorem
0.21/0.50	# SZS output start CNFRefutation
0.21/0.50	thf(decl_sort1, type, a: $tType).
0.21/0.50	thf(decl_23, type, cQ: a > a > $o).
0.21/0.50	thf(decl_24, type, epred1_0: a > a > $o).
0.21/0.50	thf(decl_25, type, esk1_1: a > a).
0.21/0.50	thf(decl_26, type, esk2_0: a).
0.21/0.50	thf(decl_27, type, esk3_0: a).
0.21/0.50	thf(decl_28, type, esk4_0: a).
0.21/0.50	thf(decl_29, type, esk5_0: a).
0.21/0.50	thf(decl_30, type, esk6_0: a).
0.21/0.50	thf(decl_31, type, esk7_0: a).
0.21/0.50	thf(cTHM559A_pme, conjecture, (?[X1:a > a > $o]:(![X2:a]:(((?[X3:a]:((X1 @ X2 @ X3))&![X4:a]:(((X1 @ X2 @ X4)=>![X5:a]:(((cQ @ X4 @ X5)<=>(X1 @ X2 @ X5))))))&(X1 @ X2 @ X2))))=>((![X2:a, X5:a]:(((cQ @ X2 @ X5)=>(cQ @ X5 @ X2)))&![X2:a, X5:a, X3:a]:(((cQ @ X2 @ X3)<=((cQ @ X5 @ X3)&(cQ @ X2 @ X5)))))&![X2:a]:((cQ @ X2 @ X2)))), file('/export/starexec/sandbox/tmp/tmp.t66SvZXAMl/E---3.1_25596.p', cTHM559A_pme)).
0.21/0.50	thf(c_0_1, negated_conjecture, ~((?[X1:a > a > $o]:(![X2:a]:(((?[X3:a]:((X1 @ X2 @ X3))&![X4:a]:(((X1 @ X2 @ X4)=>![X5:a]:(((cQ @ X4 @ X5)<=>(X1 @ X2 @ X5))))))&(X1 @ X2 @ X2))))=>((![X2:a, X5:a]:(((cQ @ X2 @ X5)=>(cQ @ X5 @ X2)))&![X2:a, X5:a, X3:a]:((((cQ @ X5 @ X3)&(cQ @ X2 @ X5))=>(cQ @ X2 @ X3))))&![X2:a]:((cQ @ X2 @ X2))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM559A_pme])])).
0.21/0.50	thf(c_0_2, negated_conjecture, ![X18:a, X20:a, X21:a]:(((((epred1_0 @ X18 @ (esk1_1 @ X18))&((~(cQ @ X20 @ X21)|(epred1_0 @ X18 @ X21)|~(epred1_0 @ X18 @ X20))&(~(epred1_0 @ X18 @ X21)|(cQ @ X20 @ X21)|~(epred1_0 @ X18 @ X20))))&(epred1_0 @ X18 @ X18))&(((((cQ @ esk5_0 @ esk6_0)|(cQ @ esk2_0 @ esk3_0)|~(cQ @ esk7_0 @ esk7_0))&((cQ @ esk4_0 @ esk5_0)|(cQ @ esk2_0 @ esk3_0)|~(cQ @ esk7_0 @ esk7_0)))&(~(cQ @ esk4_0 @ esk6_0)|(cQ @ esk2_0 @ esk3_0)|~(cQ @ esk7_0 @ esk7_0)))&((((cQ @ esk5_0 @ esk6_0)|~(cQ @ esk3_0 @ esk2_0)|~(cQ @ esk7_0 @ esk7_0))&((cQ @ esk4_0 @ esk5_0)|~(cQ @ esk3_0 @ esk2_0)|~(cQ @ esk7_0 @ esk7_0)))&(~(cQ @ esk4_0 @ esk6_0)|~(cQ @ esk3_0 @ esk2_0)|~(cQ @ esk7_0 @ esk7_0)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
0.21/0.50	thf(c_0_3, negated_conjecture, ![X2:a, X3:a, X4:a]:(((cQ @ X4 @ X3)|~((epred1_0 @ X2 @ X3))|~((epred1_0 @ X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_4, negated_conjecture, ![X2:a]:((epred1_0 @ X2 @ X2)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_5, negated_conjecture, ![X2:a, X3:a]:(((cQ @ X2 @ X3)|~((epred1_0 @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.21/0.50	thf(c_0_6, negated_conjecture, ((cQ @ esk5_0 @ esk6_0)|(cQ @ esk2_0 @ esk3_0)|~((cQ @ esk7_0 @ esk7_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_7, negated_conjecture, ![X2:a]:((cQ @ X2 @ X2)), inference(spm,[status(thm)],[c_0_5, c_0_4])).
0.21/0.50	thf(c_0_8, negated_conjecture, ![X4:a, X3:a, X2:a]:(((epred1_0 @ X4 @ X3)|~((cQ @ X2 @ X3))|~((epred1_0 @ X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_9, negated_conjecture, ((cQ @ esk5_0 @ esk6_0)|(cQ @ esk2_0 @ esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7])])).
0.21/0.50	thf(c_0_10, negated_conjecture, ((cQ @ esk4_0 @ esk5_0)|(cQ @ esk2_0 @ esk3_0)|~((cQ @ esk7_0 @ esk7_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_11, negated_conjecture, ![X2:a]:(((cQ @ esk2_0 @ esk3_0)|(epred1_0 @ X2 @ esk6_0)|~((epred1_0 @ X2 @ esk5_0)))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.21/0.50	thf(c_0_12, negated_conjecture, ((cQ @ esk4_0 @ esk5_0)|(cQ @ esk2_0 @ esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_7])])).
0.21/0.50	thf(c_0_13, negated_conjecture, ![X2:a]:(((cQ @ esk2_0 @ esk3_0)|(cQ @ X2 @ esk6_0)|~((epred1_0 @ X2 @ esk5_0)))), inference(spm,[status(thm)],[c_0_5, c_0_11])).
0.21/0.50	thf(c_0_14, negated_conjecture, ![X2:a]:(((cQ @ esk2_0 @ esk3_0)|(epred1_0 @ X2 @ esk5_0)|~((epred1_0 @ X2 @ esk4_0)))), inference(spm,[status(thm)],[c_0_8, c_0_12])).
0.21/0.50	thf(c_0_15, negated_conjecture, ((cQ @ esk2_0 @ esk3_0)|~((cQ @ esk4_0 @ esk6_0))|~((cQ @ esk7_0 @ esk7_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_16, negated_conjecture, ((cQ @ esk5_0 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))|~((cQ @ esk7_0 @ esk7_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_17, negated_conjecture, ![X2:a]:(((cQ @ esk2_0 @ esk3_0)|(cQ @ X2 @ esk6_0)|~((epred1_0 @ X2 @ esk4_0)))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.21/0.50	thf(c_0_18, negated_conjecture, ((cQ @ esk2_0 @ esk3_0)|~((cQ @ esk4_0 @ esk6_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_7])])).
0.21/0.50	thf(c_0_19, negated_conjecture, ((cQ @ esk5_0 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_7])])).
0.21/0.50	thf(c_0_20, negated_conjecture, ((cQ @ esk4_0 @ esk5_0)|~((cQ @ esk3_0 @ esk2_0))|~((cQ @ esk7_0 @ esk7_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_21, negated_conjecture, (cQ @ esk2_0 @ esk3_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_4]), c_0_18])).
0.21/0.50	thf(c_0_22, negated_conjecture, ![X2:a]:(((epred1_0 @ X2 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))|~((epred1_0 @ X2 @ esk5_0)))), inference(spm,[status(thm)],[c_0_8, c_0_19])).
0.21/0.50	thf(c_0_23, negated_conjecture, ((cQ @ esk4_0 @ esk5_0)|~((cQ @ esk3_0 @ esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_7])])).
0.21/0.50	thf(c_0_24, negated_conjecture, ![X2:a]:(((epred1_0 @ X2 @ esk3_0)|~((epred1_0 @ X2 @ esk2_0)))), inference(spm,[status(thm)],[c_0_8, c_0_21])).
0.21/0.50	thf(c_0_25, negated_conjecture, ![X2:a]:(((cQ @ X2 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))|~((epred1_0 @ X2 @ esk5_0)))), inference(spm,[status(thm)],[c_0_5, c_0_22])).
0.21/0.50	thf(c_0_26, negated_conjecture, ![X2:a]:(((epred1_0 @ X2 @ esk5_0)|~((cQ @ esk3_0 @ esk2_0))|~((epred1_0 @ X2 @ esk4_0)))), inference(spm,[status(thm)],[c_0_8, c_0_23])).
0.21/0.50	thf(c_0_27, negated_conjecture, (~((cQ @ esk4_0 @ esk6_0))|~((cQ @ esk3_0 @ esk2_0))|~((cQ @ esk7_0 @ esk7_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_28, negated_conjecture, ![X3:a, X2:a]:(((cQ @ esk3_0 @ X2)|~((epred1_0 @ X3 @ esk2_0))|~((epred1_0 @ X3 @ X2)))), inference(spm,[status(thm)],[c_0_3, c_0_24])).
0.21/0.50	thf(c_0_29, negated_conjecture, ![X2:a]:(((cQ @ X2 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))|~((epred1_0 @ X2 @ esk4_0)))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.21/0.50	thf(c_0_30, negated_conjecture, (~((cQ @ esk3_0 @ esk2_0))|~((cQ @ esk4_0 @ esk6_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_7])])).
0.21/0.50	thf(c_0_31, negated_conjecture, ![X2:a]:(((cQ @ esk3_0 @ X2)|~((epred1_0 @ esk2_0 @ X2)))), inference(spm,[status(thm)],[c_0_28, c_0_4])).
0.21/0.50	thf(c_0_32, negated_conjecture, ~((cQ @ esk3_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_4]), c_0_30])).
0.21/0.50	thf(c_0_33, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_4]), c_0_32]), ['proof']).
0.21/0.50	# SZS output end CNFRefutation
0.21/0.50	# Parsed axioms                        : 3
0.21/0.50	# Removed by relevancy pruning/SinE    : 0
0.21/0.50	# Initial clauses                      : 12
0.21/0.50	# Removed in clause preprocessing      : 2
0.21/0.50	# Initial clauses in saturation        : 10
0.21/0.50	# Processed clauses                    : 84
0.21/0.50	# ...of these trivial                  : 0
0.21/0.50	# ...subsumed                          : 11
0.21/0.50	# ...remaining for further processing  : 73
0.21/0.50	# Other redundant clauses eliminated   : 0
0.21/0.50	# Clauses deleted for lack of memory   : 0
0.21/0.50	# Backward-subsumed                    : 12
0.21/0.50	# Backward-rewritten                   : 18
0.21/0.50	# Generated clauses                    : 160
0.21/0.50	# ...of the previous two non-redundant : 152
0.21/0.50	# ...aggressively subsumed             : 0
0.21/0.50	# Contextual simplify-reflections      : 2
0.21/0.50	# Paramodulations                      : 160
0.21/0.50	# Factorizations                       : 0
0.21/0.50	# NegExts                              : 0
0.21/0.50	# Equation resolutions                 : 0
0.21/0.50	# Disequality decompositions           : 0
0.21/0.50	# Total rewrite steps                  : 37
0.21/0.50	# ...of those cached                   : 29
0.21/0.50	# Propositional unsat checks           : 0
0.21/0.50	#    Propositional check models        : 0
0.21/0.50	#    Propositional check unsatisfiable : 0
0.21/0.50	#    Propositional clauses             : 0
0.21/0.50	#    Propositional clauses after purity: 0
0.21/0.50	#    Propositional unsat core size     : 0
0.21/0.50	#    Propositional preprocessing time  : 0.000
0.21/0.50	#    Propositional encoding time       : 0.000
0.21/0.50	#    Propositional solver time         : 0.000
0.21/0.50	#    Success case prop preproc time    : 0.000
0.21/0.50	#    Success case prop encoding time   : 0.000
0.21/0.50	#    Success case prop solver time     : 0.000
0.21/0.50	# Current number of processed clauses  : 33
0.21/0.50	#    Positive orientable unit clauses  : 5
0.21/0.50	#    Positive unorientable unit clauses: 0
0.21/0.50	#    Negative unit clauses             : 1
0.21/0.50	#    Non-unit-clauses                  : 27
0.21/0.50	# Current number of unprocessed clauses: 40
0.21/0.50	# ...number of literals in the above   : 113
0.21/0.50	# Current number of archived formulas  : 0
0.21/0.50	# Current number of archived clauses   : 40
0.21/0.50	# Clause-clause subsumption calls (NU) : 535
0.21/0.50	# Rec. Clause-clause subsumption calls : 451
0.21/0.50	# Non-unit clause-clause subsumptions  : 13
0.21/0.50	# Unit Clause-clause subsumption calls : 24
0.21/0.50	# Rewrite failures with RHS unbound    : 0
0.21/0.50	# BW rewrite match attempts            : 10
0.21/0.50	# BW rewrite match successes           : 2
0.21/0.50	# Condensation attempts                : 84
0.21/0.50	# Condensation successes               : 0
0.21/0.50	# Termbank termtop insertions          : 3106
0.21/0.50	# Search garbage collected termcells   : 330
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.010 s
0.21/0.50	# System time              : 0.001 s
0.21/0.50	# Total time               : 0.011 s
0.21/0.50	# Maximum resident set size: 1768 pages
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.013 s
0.21/0.50	# System time              : 0.002 s
0.21/0.50	# Total time               : 0.015 s
0.21/0.50	# Maximum resident set size: 1792 pages
0.21/0.50	% E exiting
0.21/0.50	% E exiting
0.21/0.50	EOF